منابع مشابه
Node-Capacitated Ring Routing
We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly that there exists such a flow if and only if the so-called distance inequality holds for every choice of distan...
متن کاملAn Algorithm for Node-Capacitated Ring Routing
A strongly polynomial time algorithm is described to solve the node-capacitated routing problem in an undirected ring network.
متن کاملCapacitated Node Routing Problems
This abstract describes a branch, cut, and price (BCP) algorithm for the solution of a class of network design problems with routing and packing constraints that can all be seen as special cases of a general model we will call the Capacitated Node Routing Problem (CNRP). We present several alternative integer programming formulation of the CNRP that can be shown to generalize a number of other ...
متن کاملNode Duplication Lower Bounds for the Capacitated Arc Routing Problem
It is well-known that the tight lower bounds determine the effectiveness of the brancn and bound method for the NP-hard problems. In this paper, we present a new lower bounding procedure for the capacitated arc routing problem (CARP), one of the arc routing problems. They give the tight lower bounds and it is easy to develop an exact algorithm usinl~ their network structures.
متن کاملLocal routing algorithms for node-capacitated multicommodity broadcast
Given a directed network with upload and download capacities at nodes, we consider the multicommodity relay-free multicast problem: there are k multicast sessions, each with a source si ∈ V , receiver set Ri ⊆ V and demand λi > 0, with the constraint that nodes only forward packets of commodities for which they are also a receiver. When each Ri is a clique, we prove that whenever demands {λi + ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2002
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.27.2.372.323